An Algorithm to Generate Random Large Combinational Circuits
نویسندگان
چکیده
منابع مشابه
An Interconnectivity based Efficient Partitioning Algorithm of Combinational CMOS Circuits
In this new technology era, circuit partitioning is a fundamental problem in very large-scale integration (VLSI) physical design automation. In this brief, we present a new interconnection oriented clustering algorithm for combinational VLSI circuit partitioning. The proposed clustering method focuses on capturing clusters in a circuit, i. e. , the groups of cells that are highly interconnected...
متن کاملTitle : Parallel Synthesis of Large Combinational Circuits for Fpgas Parallel Synthesis of Large Combinational Circuits for Fpgas
Presentation mode : Standard Poster + (eventually) software demonstration/documentation access via rlogin to Unix workstation and WWW access to our site. Abstract. High level synthesis tools are the main stream today for the rapid design of electronic circuits. At a lower level, logic synthesis systems like SIS 3] are in charge of the optimization of the combinational part of the circuit. These...
متن کاملAn Evolutionary Approach to the Synthesis of Combinational Circuits
This paper proposes a genetic algorithm for designing combinational logic circuits and studies four different case examples: 2-to-1 multiplexer, one-bit full adder, four-bit parity checker and a two-bit multiplier. The objective of this work is to generate a functional circuit with the minimum number of gates.
متن کاملVHDL Implementation of Genetic Algorithm for Evolutionary Combinational Circuits
Electronic hardware’s demandsthat the simple in architecture, power consumption, speed in operation and should be automatically regenerating the program if the program is failure. Genetic algorithm is one of the evolutionary algorithms. Using evolutionary algorithm we can get the desired program automatically. FPGA configuration bits are perfectly matches with binary bits of evolvable hardware....
متن کاملA fast fault simulation algorithm for combinational circuits
The performance of a fast fault simulation algorithm for combinational circuits, such as the critical path tracing method, is determined primarily by the efficiency with which it can deduce the detectability of stem faults (stem analysis). We propose a graph based approach to perform stem analysis. A dynamic data structure, called the criticality constraint graph, is used during the backward pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1993
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/36.2.200